Database Theory Column Victor Vianu Query Languages for Bags Expressive Power and Complexity 1

نویسندگان

  • Victor Vianu
  • Leonid Libkin
  • Tova Milo
  • Limsoon Wong
چکیده

One of the characteristics of advanced database systems is that they must handle data which no longer ts the traditional relational style. The present column summarizes recent results on one such extension, where databases handle bags (multisets) rather than just sets. The results illustrate an important research direction in Database Theory. Abstract Most database theory focused on investigating databases containing sets of tuples. In practice databases often implement relations using bags, i.e. sets with duplicates. In this paper we study how database query languages are aaected by the use of duplicates. We consider query languages that are simple extensions of the (nested) relational algebra, and investigate their resulting expressive power and complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal Forms and Conservative Extension Properties for Query Languages over Collection Types

Strong normalization results are obtained for a general language for collection types. An induced normal form for sets and bags is then used to show that the class of functions whose input has height (that is, the maximal depth of nestings of sets/bags/lists in the complex object) at most i and output has height at most o de nable in a nested relational query language without powerset operator ...

متن کامل

The Power of Methods With Parallel Semantics

A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, parallel synchronous semantics with concurrentread and concurrent-write. The results focus on the expressive power of methods and help understand various constructs and semantics associated with methods. Restrictions of metho...

متن کامل

Describing and Quering Semistructured Data: Some Expressiveness Results

Data in traditional relational and object-oriented databases is highly structured and subject to explicit schemas. Lots of data, for example on the world-wide web is only semistruetured. There may be some regularities, but not all data need adhere to it, and the format itself may be subject to frequent change. The important issues in the area of semistructured data are: how to describe (or cons...

متن کامل

Logics with Aggregate

We study adding aggregate operators, such as summing up elements of a column of a relation, to logics with counting mechanisms. The primary motivation comes from database applications, where aggregate operators are present in all real life query languages. Unlike other features of query languages, aggregates are not adequately captured by the existing logical formalisms. Consequently, all previ...

متن کامل

Dagstuhl Workshop on Finite Model Theory, Databases, and Computer Aided Verification

A common concern of FMT, DB and CAV is the design and study of logical formalisms with the ‘right’ balance between expressiveness and complexity. In databases, query languages are developed that should be expressive enough for the relevant queries of a given application area, but nevertheless lend themselves to efficient strategies for query evaluation. In CAV, specification languages are sough...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007